Higher-Order Rewriting
نویسنده
چکیده
Note: This paper will appear in the proceedings of the 10th international conference on rewriting techniques and applications (RTA'99). c Springer Verlag.
منابع مشابه
A Transformation System Combining Partial Evaluation with Term Rewriting
This paper presents a new approach to optimizing functional programs based on combining partial evaluation and rewriting. Programs are composed of higher-order primitives. Partial evaluation is used to eliminate higher-order functions. First-order rewriting is used to process the transformation. Laws about the higher-order primitives that are relevant for the optimizations are automatically ext...
متن کاملHigher - Order ( Non - ) Modularity Claus
We show that, contrary to the situation in first-order term rewriting, almost none of the usual properties of rewriting are modular for higher-order rewriting, irrespective of the higher-order rewriting format. We show that for the particular format of simply typed applicative term rewriting systems modularity of confluence, normalization, and termination can be recovered by imposing suitable l...
متن کاملHigher-Order (Non-)Modularity
We show that, contrary to the situation in first-order term rewriting, almostnone of the usual properties of rewriting are modular for higher-order rewriting, irre-spective of the higher-order rewriting format. For the particular format of simply typedapplicative term rewriting systems we prove that modularity of confluence, normalization,and termination can be recovered by impo...
متن کاملA Transformation System Combining Partial Evaluation
This paper presents a new approach to optimizing functional programs based on combining partial evaluation and rewriting. Programs are composed of higher-order primitives. Partial evaluation is used to eliminate higher-order functions. First-order rewriting is used to process the transformation. Laws about the higher-order primitives that are relevant for the optimizations are automatically ext...
متن کاملErasure and Termination in Higher-Order Rewriting
Two applications of the Erasure Lemma for first-order orthogonal term rewriting systems are: weak innermost termination implies termination, and weak normalization implies strong normalization for non-erasing systems. We discuss these two results in the setting of higher-order rewriting.
متن کاملA de Bruijn notation for higher - order rewriting ( Extended
We propose a formalism for higher-order rewriting in de Bruijn notation. This notation not only is used for terms (as usually done in the literature) but also for metaterms, which are the syntactical objects used to express general higher-order rewrite systems. We give formal translations from higher-order rewriting with names to higher-order rewriting with de Bruijn indices, and vice-versa. Th...
متن کامل